An Iterative Refinement Algorithm for the Minimum Branch Vertices Problem
نویسندگان
چکیده
Dept. of Computer Science, Federal University of Lavras C.P. 3037, CEP 37200-000, Lavras, MG, Brazil [email protected],[email protected] Dept. of Computer Science, Federal University of Minas Gerais C.P. 702, CEP 31270-010, Belo Horizonte, MG, Brazil [email protected],[email protected] Center of Informatics, Federal University of Pernambuco Av. Jornalista Anibal Fernandes, s/n Cidade Universitária, CEP 50.740-560, Recife, PE, Brazil [email protected] LIAAD, Faculdade de Economia do Porto, Rua Dr. Roberto Frias, s/n. 4200-464 Porto, Portugal [email protected] Internet and Network Systems Research, AT&T Labs Research 180 Park Avenue, Room C241, Florham Park, NJ 07932 USA [email protected] Dept. of Mathematics and Applications “R. Caccioppoli”, University of Napoli FEDERICO II Compl. MSA, Via Cintia 80126, Napoli, Italy [email protected]
منابع مشابه
A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem
The minimum k-partition (MkP) problem is the problem of partitioning the set of vertices of a graph into k disjoint subsets so as to minimize the total weight of the edges joining vertices in the same partition. The main contribution of this paper is the design and implementation of a branch-and-cut algorithm based on semidefinite programming (SBC) for the MkP problem. The two key ingredients f...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملUnit commitment by a fast and new analytical non-iterative method using IPPD table and “λ-logic” algorithm
Many different methods have been presented to solve unit commitment (UC) problem in literature with different advantages and disadvantages. The need for multiple runs, huge computational burden and time, and poor convergence are some of the disadvantages, where are especially considerable in large scale systems. In this paper, a new analytical and non-iterative method is presented to solve UC p...
متن کاملAn Explicit Viscosity Iterative Algorithm for Finding Fixed Points of Two Noncommutative Nonexpansive Mappings
We suggest an explicit viscosity iterative algorithm for finding a common element in the set of solutions of the general equilibrium problem system (GEPS) and the set of all common fixed points of two noncommuting nonexpansive self mappings in the real Hilbert space.
متن کاملA branch-and-cut algorithm for the minimum branch vertices spanning tree problem
Given a connected undirected graph G = (V;E), the Minimum Branch Vertices Problem (MBVP) asks for a spanning tree of G with the minimum number of vertices having degree greater than two in the tree. These are called branch vertices. This problem, which has an application in the context of optical networks, is known to be NPhard. We model the MBVP as an integer linear program, with undirected va...
متن کامل